453A - Little Pony and Expected Maximum - CodeForces Solution

probabilities *1600

Please click on ads to support us..

Python Code: 

m, n = [int(i) for i in input().split()]

res = 0

for i in range(1, m+1):
    res += i*(pow(i/m,n)- pow((i-1)/m, n))

print("{:.12f}".format(res))

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
#define int long long
int m,n;
double quick_power(double base,int x){
	double ret=1;
	while(x){
		if(x&1)ret*=base;
		base*=base;
		x=x>>1;
	}
	return ret;
}
signed main(){
	scanf("%lld %lld",&m,&n);
	double ans=0;
	for(int i=1;i<=m;i++)
	    ans+=i*(quick_power(i/1.0/m,n)-quick_power((i-1)/1.0/m,n));
	printf("%lf",ans);
	return 0;
}


Comments

Submit
0 Comments
More Questions

979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits